Packing problem - PDFSEARCH.IO - Document Search Engine

Packing problem
Results: 195

#	Item
151	Abstract flows over time: A first step towards solving dynamic packing problems? Jan-Philipp W. Kappmeier, Jannik Matuschke, and Britta Peis TU Berlin, Institut f¨ ur Mathematik, Straße des 17. Juni 136, 10623 Berlin, Add to Reading List Source URL: www.redaktion.tu-berlin.de Language: English - Date: 2012-11-12 07:12:44 Combinatorics Maximum flow problem Flow network Dimensional analysis Fluid dynamics Cut Max-flow min-cut theorem Ford–Fulkerson algorithm Network flow Graph theory Mathematics
152	Comparing Graph Representations of Protein Structure for Mining Family-Specific Residue-Based Packing Motifs Jun Huan1 , Deepak Bandyopadhyay1, Wei Wang1 , Jack Snoeyink1, Jan Prins1 , Alexander Tropsha2 1 Department of Add to Reading List Source URL: www.cs.ucla.edu Language: English - Date: 2005-01-05 23:31:15 Dense graph Subgraph isomorphism problem Line graph Universal graph Graph theory Graph operations Cograph
153	Instance-Sensitive Robustness Guarantees for Sequencing with Unknown Packing and Covering Constraints∗ [Extended Abstract] † ‡ Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:06:05 Mathematical analysis Knapsack problem Dynamic programming Mathematical optimization Pi Μ operator Operations research Theoretical computer science Applied mathematics
154	A Genetic Algorithm for the Two-Dimensional Knapsack Problem with Rectangular Pieces Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-11-29 06:50:37 Combinatorial optimization Operations research Packaging Bin packing problem Genetic algorithm Packing problem Knapsack problem Heuristic Mathematical optimization Theoretical computer science Mathematics Applied mathematics
155	A Tree Search Algorithm for Solving the Container Loading Problem Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-11-29 06:50:37 Discrete geometry NP-complete problems Packaging Packing problem BL1 Box Knapsack problem Bin packing problem Cuboid Mathematics Theoretical computer science Geometry
156	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
157	Chapter 4: Deterministic Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Operations research Linear programming Combinatorial optimization Linear programming relaxation Relaxation Bin packing problem Approximation algorithm Mathematical optimization Theoretical computer science Applied mathematics
158	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:04 Approximation algorithm Computational complexity theory Bin packing problem Summation Theoretical computer science Mathematics Applied mathematics
159	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
160	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:04

UPDATE